Improving Route Discovery Using Stable Connected Dominating Set in MANETs
نویسندگان
چکیده
A Connected Dominating Set (CDS) based virtual backbone plays an important role in wireless ad hoc networks for efficient routing and broadcasting. Each node in the network can select some of its 1-hop neighbors as Multi Point Relay (MPR) to cover all its 2-hop neighbors. A MPR based CDS is a promising approach for broadcasting. A node in the CDS consumes more energy and the energy depletes quickly than non dominating nodes. Although previous CDS construction algorithms achieve good results in terms of the size of CDS, a minimum size CDS does not necessarily guarantee an optimal network performance from an energy efficient point of view. In this paper, we propose a distributed algorithm for energy efficient stable MPR based CDS construction to extend the lifetime of ad hoc wireless networks by considering energy and velocity of nodes. We have also implemented route discovery protocol to make use of the CDS nodes to relay route request messages. The simulation results show that our algorithm increases the lifetime up to 25% than previous works and 60% reduction in the route request messages during route discovery process.
منابع مشابه
Weighted Steiner Connected Dominating Set and its Application to Multicast Routing in Wireless MANETs
In this paper, we first propose three centralized learning automata-based heuristic algorithms for approximating a near optimal solution to the minimum weight Steiner connected dominating set (WSCDS) problem. Finding the Steiner connected dominating set of the network graph is a promising approach for multicast routing in wireless ad-hoc networks. Therefore, we present a distributed implementat...
متن کاملImproving route discovery in on-demand routing protocols using two-hop connected dominating sets
Many signaling or data forwarding operations involve the broadcasting of packets, which incurs considerable collisions in ad hoc networks based on a contention-based channel access protocol. We propose the Threehop Horizon Pruning (THP) algorithm to compute two-hop connected dominating set (TCDS) using only local topology information (i.e., two-hop neighborhood). Because every node has the two-...
متن کاملGraph Theory Algorithms for Mobile Ad hoc Networksh
Various simulators (e.g., ns-2 and GloMoSim) are available to implement and study the behavior of the routing protocols for mobile ad hoc networks (MANETs). But, students and investigators who are new to this area often get perplexed in the complexity of these simulators and lose the focus in designing and analyzing the characteristics of the network and the protocol. Most of the time would be ...
متن کاملA Zonal Algorithm for Clustering An Hoc Networks
A Mobile Ad Hoc Network (MANET) is an infrastructureless wireless network that can support highly dynamic mobile units. The multi-hop feature of a MANET suggests the use of clustering to simplify routing. Graph domination can be used in defining clusters in MANETs. A variant of dominating set which is more suitable for clustering MANETs is the weakly-connected dominating set. A cluster is defin...
متن کاملConnected Dominating Set in Sensor Networks and MANETs
3 Centralized CDS Construction 335 3.1 Guha and Khuller’s Algorithm . . . . . . . . . . . . . . . . . . . . . 336 3.2 Ruan’s Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 338 3.3 Cheng’s Greedy Algorithm . . . . . . . . . . . . . . . . . . . . . . . . 340 3.4 Min’s Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 341 3.5 Butenko’s Algorithm . . . . . . ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1204.2041 شماره
صفحات -
تاریخ انتشار 2012